Dynamic algorithms for monotonic interval scheduling problem
نویسندگان
چکیده
Imagine a number of processes all need to use a particular resource for a period of time. Each process i specifies a starting time s(i) and a finishing time f(i) between which it needs to continuously occupy the resource. The resource cannot be shared by two processes at any instance. One is required to design a scheduler which chooses a subset of these processes so that 1) there is no time conflict between processes in using the resource; and 2) there are as many processes as possible that get chosen.
منابع مشابه
Efficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملPreemptive Scheduling of Periodic Tasks on Multiprocessor: Dynamic Algorithms and Their Performance
In this paper, the problem of preemptively scheduling a set of periodic tasks on a multiprocessor is considered. Three dynamic algorithms are proposed, and their performance is studied. These algorithms are Rate-Monotonic-NextFit-WC (RMNF-WC), Rate-Monotonic-First-Fit-WC (RMFF-WC), and RateMonotonic-Best-Fit-WC (RMBF-WC), and their worst-case performance is shown to be tightly bounded by 2.88, ...
متن کاملProbabilistic Real-Time Data Access with Interval Constraints
Real-time data management for manufacturing control applications indicates a need for probabilistic deadline guarantees and interval constraints. When shared data objects are treated as resources, real-time data management becomes a resourceconstrained real-time scheduling problem. In this paper, we perform simulations and measurements to evaluate the utilities of existing real-time scheduling ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 562 شماره
صفحات -
تاریخ انتشار 2015